IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Performance Bounds for Erasure, List and Feedback Schemes with Linear Block Codes

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Erasure/List Exponents for Slepian-Wolf Decoding

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Burst-Erasure Correcting Codes with Optimal Average Delay

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Erasure/List Random Coding Error Exponents Are Not Universally Achievable

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Gallager-Type Bounds for Non-Binary Linear Block Codes over Memoryless Symmetric Channels

The performance of non-binary linear block codes is studied in this paper via the derivation of new upper bounds on the error probability under ML decoding. The transmission of these codes is assumed to take place over a memoryless and symmetric channel. The new bounds, which rely on the Gallager bounding technique, are applied to expurgated ensembles of non-binary and regular low-density parit...

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Achievable Error Exponents for Channel with Side Information ― Erasure and List Decoding

We consider a decoder with an erasure option and a variable size list decoder for channels with non-casual side information at the transmitter. First, universally achievable error exponents are offered for decoding with an erasure option using a parameterized decoder in the spirit of Csiszár and Körner’s decoder. Then, the proposed decoding rule is generalized by extending the range of its para...